A Congested Facility Location Problem
نویسندگان
چکیده
Consider a network facility location problem where congestion arises at facilities, and is represented by delay functions that approximate the queueing process. We strive to minimize the sum of customers' transportation and waiting times, and facilities' xed and variable costs. The problem is solved using a column generation technique within a Branch-and-Bound scheme. Numerical results are reported and a bilevel (user-optimized) formulation considered, among other extensions.
منابع مشابه
A New Model for Location-Allocation Problem within Queuing Framework
This paper proposes a bi-objective model for the facility location problem under a congestion system. The idea of the model is motivated by applications of locating servers in bank automated teller machines (ATMS), communication networks, and so on. This model can be specifically considered for situations in which fixed service facilities are congested by stochastic demand within queueing frame...
متن کاملMaximal Benefit Location Problem for A Congested System
Some servers are to be located at nodes of a network. Demand for services of these servers is located at each node and a subset of the nodes is to be chosen to locate one server in each. Each customer selects a server with a probability dependent on distance and a certain amount of benefit is achieved after giving service to the customer. Customers may waive receiving service with a known prob...
متن کاملA Congested Double Path Approach for a Hub Location-allocation Problem with Service Level at Hubs
In this paper an uncapacitated multiple allocation p-hub median problem is discussed. The model minimizes the transportation cost based on inventory service level at hubs through double paths between hubs. Inventory service level is defined as the percent of inventory shortage of vehicles at hubs according to passengers demand and replenishment time of vehicles. A real data from 25 nodes of mun...
متن کاملReliable location-allocation model for congested systems under disruptions using accelerated Benders decomposition
This paper aims to propose a reliable location-allocation model where facilities are subject to the risk of disruptions. Since service facilities are expected to satisfy random and heavy demands, we model the congested situations in the system within a queuing framework which handles two sources of uncertainty associated with demand and service. To insure the service quality, a minimum limit re...
متن کاملBi-objective optimization of multi-server intermodal hub-location-allocation problem in congested systems: modeling and solution
A new multi-objective intermodal hub-location-allocation problem is modeled in this paper in which both the origin and the destination hub facilities are modeled as an M/M/m queuing system. The problem is being formulated as a constrained bi-objective optimization model to minimize the total costs as well as minimizing the total system time. A small-size problem is solved on the GAMS software t...
متن کاملOptimal Capacities in Discrete Facility Location Design Problem
Network location models comprise one of the main categories of location models. These models have various applications in regional and urban planning as well as in transportation, distribution, and energy management. In a network location problem, nodes represent demand points and candidate locations to locate the facilities. If the links network is unchangeably determined, the problem will be ...
متن کامل